Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

نویسندگان

چکیده

This paper considers the hybrid flow shop scheduling problem with two types of sequence-dependent setup times, one depending on order jobs and other both machines where are allocated. Three constructive heuristic algorithms based NEH algorithm developed object minimizing total energy consumption cost. The first algorithm, called EPRA, obtains using cost processing time. second ESRA, third ESPRA, takes advantage EPRA ESRA by constructing fictitious acquiring sequence EPRA. Due to drawback for FFS proposed in this paper, all three use EST rules allocate machines. Two lower bounds evaluate paper. A computational experiment split-plot design is carry out factor analysis, CPU running time analysis. analysis reveals that main interactions except significant; ESPRA generally outstanding among algorithms; LB1 better than LB2; significantly reduced compared those ESST algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

متن کامل

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

متن کامل

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

متن کامل

an assembly flow-shop scheduling problem with sequence-dependent setup and transportation times

in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2022

ISSN: ['1026-7077', '1563-5147', '1024-123X']

DOI: https://doi.org/10.1155/2022/8682203